An Algorithm for Aspects of Semantic Interpretation Using an Enhanced WordNet
نویسنده
چکیده
منابع مشابه
An Improved Semantic Schema Matching Approach
Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...
متن کاملQuery Architecture Expansion in Web Using Fuzzy Multi Domain Ontology
Due to the increasing web, there are many challenges to establish a general framework for data mining and retrieving structured data from the Web. Creating an ontology is a step towards solving this problem. The ontology raises the main entity and the concept of any data in data mining. In this paper, we tried to propose a method for applying the "meaning" of the search system, But the problem ...
متن کاملGrounding the Ontology on the Semantic Interpretation Algorithm
Some reorganizations and modifications to the WordNet ontology are explained. These changes have been suggested by extensive testing of the ontological categories with an algorithm for semantic interpretation The algorithm is based on predicates that have been defined for WordNet verb classes. The selectional restrictions of the predicates are WordNet ontological categories.
متن کاملAutomatic Construction of Persian ICT WordNet using Princeton WordNet
WordNet is a large lexical database of English language, in which, nouns, verbs, adjectives, and adverbs are grouped into sets of cognitive synonyms (synsets). Each synset expresses a distinct concept. Synsets are interlinked by both semantic and lexical relations. WordNet is essentially used for word sense disambiguation, information retrieval, and text translation. In this paper, we propose s...
متن کاملA System for the Semantic Interpretation of Unrestricted Domains using WordNet
In this demonstration, we show an algorithm for the semantic interpretation of unrestricted texts. The algorithm presents a solution for the following interpretation problems: determination of the meaning of the verb, identification of thematic roles and adjuncts, and attachments of prepositional phrases (PPs). An interesting aspect of the algorithm is that the solution of all these problems is...
متن کامل